A Time-Space Tradeoff for Element Distinctness
نویسندگان
چکیده
منابع مشابه
A Time-Space Tradeoff for Element Distinctness
In a time-space tradeoff for sorting on non-oblivious machines, Borodin et. Al. [J. Comput. System Sci., 22(1981), pp. 351-364] proved that to sort $n$ elements requires $TS=\Omega(n^2)$ where $T=time$ and $S=space$ on a comparison based branching program. Although element distinctness and sorting are equivalent problems on a computation tree, the stated tradeoff result does not immediately fol...
متن کاملQuantum Algorithms for Element Distinctness
We present several applications of quantum amplitude amplification to finding claws and collisions in ordered or unordered functions. Our algorithms generalize those of Brassard, Høyer, and Tapp, and imply an O(N3=4 logN) quantum upper bound for the element distinctness problem in the comparison complexity model. This contrasts with (N logN) classical complexity. We also prove a lower bound of ...
متن کاملElement Distinctness Revisited
The element distinctness problem is the problem of determining whether the elements of a list are distinct. Classically, it requires N queries, where N is the number of elements. In the quantum case, it is possible to solve the problem in O(N) queries. The problem can be extended by asking whether there are k colliding elements, known as element k-distinctness. This work obtains optimal values ...
متن کاملTopological parameters for time-space tradeoff
In this paper we propose a family of algorithms combining treeclustering with conditioning that trade space for time. Such algorithms are useful for reasoning in probabilistic and deterministic networks as well as for accomplishing optimization tasks. By analyzing the problem structure the user can select from a spectrum of algorithms, the one that best meets a given time-space specification. T...
متن کاملA Note on Bennett's Time-Space Tradeoff for Reversible Computation
Given any irreversible program with running time T and space complexity S, and given any e > 0, Bennett shows how to construct an equivalent reversible program with running time O(T1+) and space complexity O(S In T). Although these loose upper bounds are formally correct, they are misleading due to a hidden constant factor in the space bound. It is shown that this constant factor is approximate...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 1987
ISSN: 0097-5397,1095-7111
DOI: 10.1137/0216007